Automated paragraph layout

ABSTRACT

Methods and apparatus, for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node ( 140 ). For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node ( 142 ). Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines ( 144 ). The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme ( 150 ).

[0001] This application claims priority to U.S. Provisional Application No. 60/252,863 filed Nov. 22, 2000. U.S. Provisional Application No. 60/252,863 is incorporated herein by reference in its entirety.

BACKGROUND

[0002] The invention relates to techniques for automated paragraph layout.

[0003] Paragraph layout in a document production application involves selection and placement of line breaks to produce a visually pleasing appearance within a paragraph cell that defines the space allotted for the paragraph. Changes in the style of the text, e.g., fonts, formats, line heights, and point size, can complicate the task, particularly when layout is performed within non-rectangular shapes. In addition, text styles and shape complexity can significantly increase computational overhead and processing time.

[0004] A number of techniques exist for automated paragraph layout. Many implement a line-by-line approach. Line-by-line techniques generally start with a first line, assign penalty values for possible breaks in that line, and choose the best possible line break for that line. After the first line is defined, a second line is analyzed and defined in a similar manner. Line-by-line techniques continue through a paragraph, defining each line and moving on to the next. Although these techniques minimize penalty values for each line, they may not optimize paragraph layout because the cumulative result of each collection of line breaks is never considered.

[0005] One type of more sophisticated technique for automated paragraph layout involves the formulation of a tree structure representing all possible lines for a given paragraph. This type of technique assigns a penalty value to each possible line, and picks a path through the tree with the lowest cumulative penalty. Although this is generally effective, it is very time and memory-intensive. Extensive use of system resources and protracted processing time is generally undesirable in document production, especially in light of the increasing complexities of document content.

[0006] Still other techniques make use of dynamic programming and failure functions to create algorithms that run in linear time with one backward pass through the text. See D. S. Hirschberg and L. L. Lamore, “New Applications of Failure Functions,” Journal of the Association for Computing Machinery, vol. 34, no. 3, July 1987. These dynamic programming techniques are generally less memory-intensive and very quick compared to the tree structure techniques. Complex shapes can undermine the effectiveness of such techniques, however, limiting their general application to paragraph layout. In particular, the Hirschberg/Lamore approach has proved inapplicable for shapes that deviate from a constant line width.

SUMMARY OF THE INVENTION

[0007] The invention provides systems, methods, and apparatus, including computer program apparatus embodied on computer-readable media, for automated paragraph layout. In an exemplary implementation, a process begins with a first node in the reading order of a paragraph and calculates an optimal line break scheme for a paragraph layout that ends with the node. The term “node” will be used to refer to an unbreakable segment of characters (e.g., a syllable in the English language). The phrase “line break scheme” for paragraph layout will be used to refer to a collection of line breaks in a paragraph. For every subsequent node in the paragraph, the process calculates an optimal line break scheme for a paragraph layout that ends with that subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

[0008] By calculating optimal line break schemes for each node in the paragraph, the process compiles data that is used to calculate the optimal line break schemes for subsequent nodes in the paragraph. Each optimal line break scheme associated with each node may define the most visually pleasing layout as determined by penalty values.

[0009] As the process analyzes each node, potential last lines are considered. As each potential last line is considered, the potential end of the preceding line is defined as the node immediately preceding first node of the potential last line. However, an optimal line break scheme associated with the node immediately preceding the first node of the potential last line was already calculated. Therefore, the optimal line break scheme for the whole paragraph is calculated by minimizing the collective penalty values of a potential last line and the previously calculated optimal line break scheme of a paragraph that ended with the node immediately preceding the start node of the potential last line.

[0010] After analyzing each node in the paragraph, the paragraph may be formatted in accordance with the optimal line break scheme of the last node in the paragraph. The formatted paragraph can then be displayed, e.g., on a computer screen, or printed onto print media. Alternatively, the process can be repeated for one or more additional paragraphs. Then, after formatting a finite number of paragraphs, the collection of formatted paragraphs can be displayed or printed.

[0011] When one or more line widths for an allotted paragraph space vary, it may be necessary to know the different line widths to calculate an optimal layout. Thus, in another implementation, the process calculates one or more line widths. Line width data may then be used to calculate optimal line break schemes for paragraph layout. In this manner, calculating line widths permits automated paragraph layout in irregular (e.g., non-rectangular) shapes.

[0012] In another implementation, the process re-calculates one or more optimal line break schemes when the width of a line is less than a width of a line immediately preceding it. In particular, when a subsequent line has a width dramatically smaller than the preceding line, re-calculating optimal line break schemes for previous nodes may be necessary to find the optimal line break scheme for the paragraph.

[0013] In still another implementation, the process maintains an index of candidate nodes that may be the start node of a given last line. The index may be held in a queue and the queue may be a deque (double ended queue). The index is adjusted as the process considers nodes during processing. In this manner, a node is removed from the index when it is clear that starting a last line with that node would never yield an optimal paragraph. Removing nodes from the index can increase the speed at which a paragraph can be analyzed and formatted.

[0014] In one or more implementations of the invention, the process operates without the use of a “bridge function.” Some dynamic algorithms use what is referred to as a “bridge function” or “Boolean function bridge” to remove candidates from a queue. While a bridge function could be used, the added complexity is not necessary for many implementations of the invention.

[0015] In yet another implementation a process calculates node widths. A base width can define the width of a node either in terms of the distance from the beginning of the node to the end of the node, or the base width can define the width of the node in terms of the distance from the beginning of the text to the end of the node. One or more correction widths may account for one or more adjustments to the width of the node if the node begins a line or if the node ends a line. After calculating node widths, the length of a line consisting of a sequence of nodes can be calculated.

[0016] When a particular line is broken into more than one tile, additional challenges arise. In an additional implementation, a process analyzes multi-tile lines differently than lines having a single tile. When a number of nodes are received for layout on a multi-tile line, a number of different candidate line penalties are calculated. Each candidate line penalty is associated with a unique layout of the nodes on that line. The line penalty for that line, then, can be determined as the minimum candidate line penalty.

[0017] The details of one or more implementations of the invention are set forth in the accompanying drawings, the description below, and the exemplary pseudo-code. Other features, objects, and advantages of the present invention will be apparent from the description, drawings, pseudo-code, and from the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0018]FIG. 1 is a diagram illustrating a series of constant-length lines for paragraph layout.

[0019]FIG. 2 is a diagram illustrating incorporation of text within the lines shown in FIG. 1 according to a possible paragraph layout.

[0020]FIGS. 3 and 4 are exemplary diagrams illustrating two scenarios having a series of varied-length lines disposed for paragraph layout.

[0021] FIGS. 5-7 are flow diagrams illustrating exemplary implementations of automated paragraph layout.

[0022]FIG. 8 is a series of illustrative diagrams showing potential output following each step of an exemplary process for automated paragraph layout.

[0023]FIG. 9 is a flow diagram illustrating a process that accounts for one or more potentially varying node widths.

[0024] FIGS. 10-12 are exemplary diagrams illustrating three different paragraph cells that contain lines that are broken into more than one tile.

[0025]FIG. 13 is a flow diagram illustrating a process of analyzing a paragraph that has at least one multi-tile line.

[0026]FIG. 14 is a flow diagram illustrating a process for analyzing a multi-tile line.

DETAILED DESCRIPTION

[0027]FIG. 1 illustrates a series of constant-length lines for a paragraph layout. As shown in FIG. 1, a paragraph cell 24 defines an area in which one or more lines 26, 28, 30, 32, 34, 36 may reside. Paragraph cell 24 may be positioned within a page of imagery, e.g., for print reproduction such as on paper or film or electronic presentation such as on a web page. Each line 26, 28, 30, 32, 34, 36 extends horizontally across paragraph cell 24. The sequence of lines 26, 28, 30, 32, 34, 36 extend vertically downward through paragraph cell 24. The height and shape of the characters positioned within the cell 24 may define the respective heights of the different lines 26, 28, 30, 32, 34, 36. For this reason, the characters may define both the size of lines 26, 28, 30, 32, 34, 35, and the number of lines that will fit in cell 24.

[0028]FIG. 2 illustrates placement of text in a series of lines 40, 42, 44, 46, 48, 50. In the examples of FIGS. 1 and 2, each line has a common, constant length. Therefore, each line of text has the same maximum length when considering paragraph layout. One key to automated paragraph layout is establishing a paragraph layout scheme that defines the line breaks of the paragraph in a manner that promotes a visually pleasing layout.

[0029] Penalty values can be calculated and used to differentiate visually pleasing paragraph layouts from less desirable ones. A penalty value may take a number of factors into consideration. For instance, a penalty value may take into account such things as letter size, word spacing, letter spacing, changes in word or letter format, and hyphenation. In addition, paragraph consistency may affect a penalty value. For instance, an increased penalty can be assigned to a line with narrow word spacing if it immediately follows a line with wide word spacing.

[0030] Hyphenation may affect a penalty value in several different ways. For instance, a penalty value may take into account where a particular hyphenation is occurring within an individual word, assigning greater penalties to less desirable hyphenation. In addition, repetitive hyphenation within a paragraph may further increase a penalty value. Moreover, hyphenating particular words, such as the last word on a page, may increase a penalty value.

[0031] With constant-length lines, paragraph layout is straightforward and predictable. However, when a paragraph cell contains varied-length lines, complexity of paragraph layout can increase. Indeed, some paragraph layout techniques do not work well with varied-length paragraph lines. FIGS. 3 and 4 illustrate a paragraph cell having a series of varied-length lines disposed in a paragraph layout. In FIG. 3, a series of lines 66, 68, 70, 72, 74 76, 78 have lengths that vary according to the shape of cell 62. In FIG. 4, a series of lines 84, 86, 88, 90, 92, 94 have lengths that vary according to the shape of cell 82. Space 96 may define a space for alternative imagery such as non-text, or may simply define some space allotted to some other textual or non-textual imagery.

[0032] In an exemplary implementation, a process in accordance with the invention generally implements a linear beginning-to-end pass through the text of a paragraph. A node is an unbreakable segment of one or more characters (e.g., typically a syllable in the English language, although words or phrases could be defined as unbreakable). For each node in the paragraph, an optimal line break scheme for paragraph layout ending in that node is calculated. The phrase “optimal line break scheme for paragraph layout” is used to refer to the most visually pleasing collection of line breaks in a paragraph, as determined by penalty values. As the process moves to consider subsequent nodes, the previously calculated optimal line break schemes for paragraph layouts, provide data that facilitates subsequent calculations. No line's content is defined until the process has considered every node in the paragraph. The last node in the paragraph, then, defines a last line that starts with a start node calculated by the process to produce an optimal line break scheme for paragraph layout. That calculated start node also defines the end of the second to last line because the nodes are placed sequentially in the paragraph layout.

[0033] Many of the exemplary implementations described in this specification are described in the context of the English language. In English, characters are read from left to right on horizontal lines beginning with the top line. A process in accordance with the invention, however, may be implemented for other languages as well. In some languages, for instance, characters are read from right to left on horizontal lines. And in still other languages characters are read from top to bottom on vertical lines. A process in accordance with the invention is equally effective in these and other contexts. For instance, the process may progress through the characters, nodes, words, or phrases of a paragraph, in the reading order of that paragraph, as defined by the particular language.

[0034] In one Japanese example, nodes are read from left to right on horizontal lines starting at the top of the page. However, in other Japanese texts, nodes may be read from top to bottom starting with the nodes in the rightmost line. In accordance with the invention, the process begins with the first node in reading order of the text. Thus, in Japanese, the process may begin either with the node in the upper right hand corner or the node in the upper left hand corner, depending on how the particular text is read. The process then considers the subsequent nodes in reading order, as described in detail below, and ultimately defines the optimal paragraph layout

[0035]FIG. 5 illustrates one implementation of a process in accordance with the invention. Beginning with the first node (defined at 100), one or more potential last lines for a paragraph ending in that ending node are defined (102). For instance, defining one or more potential last lines may simply involve defining or adjusting an index of candidate nodes that will be considered as possible start node of the last line. Because each node in the index is unique, each node in the index may define a unique last line of a paragraph that ends with the same ending node. For each potential last line, a paragraph penalty is calculated (106). The respective paragraph penalties are each based on the cumulative penalty of all lines in the paragraph. Node M(N) is defined as the node that starts the last line in a paragraph ending in node N such that paragraph penalty is minimized (108). This process is then repeated for subsequent nodes (110) until the end of the paragraph is reached (“yes” branch from decision step 112).

[0036] As the process analyzes each subsequent node, potential last lines are defined for a paragraph that ends in that node (102). Again, defining one or more potential last lines may simply involve defining or adjusting an index of candidate nodes that will be considered as the possible start node of the last line. For each potential last line that is considered, a paragraph penalty is calculated based on the cumulative penalty of all lines in the paragraph (106). The cumulative paragraph penalty is calculated by first calculating a last line penalty for the potential last line. Defining each potential last line also defines the potential end of the preceding line. An optimal line break scheme for paragraph layout ending in each respective potential node that may end the preceding line was already calculated. Therefore, the optimal line break scheme for the whole paragraph can be determined by minimizing the collective penalty values of a potential last line and the previously calculated optimal line break scheme for paragraph layout associated with the node that ends the second to last line. After this determination is made, node M(N) is defined as the node that starts a last line of a paragraph ending in node N (108). In this manner, Node M(N) is defined such that the penalty for the whole paragraph is minimized.

[0037]FIG. 6 illustrates another implementation of a process in accordance with the invention. Beginning with the first node (defined at 120), a paragraph ending in that node is considered. At this point, an index of the possible start nodes for the last line is adjusted (122). The index is simply a list of nodes that will be considered as the potential start node of the last line. This index of nodes may be held, for instance, in a stack, a queue, or a deque (a double ended queue). Adjusting the index may involve inserting or removing candidate nodes from index. For instance, if the index is a deque, the candidate start nodes may be held in reading order in the deque. The candidate node that comes earliest in the reading order of the paragraph may be located at the bottom of the deque and the candidate node that comes last in reading order of the paragraph may be located at the top of the deque. Nodes can be removed from top of the deque by a “pop,” or removed from the bottom of the deque by a “drop.” Nodes can be inserted at the top of the deque by a “push.” The pseudo-code below provides an example of these functions.

[0038] By adjusting the index (122), various nodes can be removed from consideration if, for instance, they would never begin an optimal last line. In this manner, adjusting the index (122) can increase the speed at which a paragraph can be analyzed and formatted. After the index has been adjusted (122), a possible start of a last line is defined by one of the nodes in the index (124). At this point, the line width for a last line starting with the possible start node can be calculated (126). As discussed in more detail below, calculating the width of the last line can facilitate paragraph layout for irregular shaped paragraph cells.

[0039] For each potential last line associated with a paragraph ending in node N, a cumulative paragraph penalty is calculated (128). After every possible last line start node, M, associated with a paragraph ending in node N has been considered (130), a start node M(N) is defined as the start node of a last line ending in Node N. M(N) defines the start node of the last line of a paragraph ending in node N such that the cumulative paragraph penalty of the whole paragraph is minimized (132). The whole process is then repeated and subsequent paragraph nodes (134) are analyzed as the ending node of a paragraph. The process repeats until the last node in the paragraph has been considered (yes branch of 136). After every node in the paragraph has been considered, the M(N) associated with the last node in the paragraph defines the paragraph's optimal line break scheme. The paragraph may then be formatted and displayed or printed in accordance with the paragraph's optimal line break scheme. Alternatively, the process can be repeated for one or more additional paragraphs.

[0040] A process in accordance with the invention generally performs a linear beginning-to-end pass through the text of a paragraph. However, to handle some special cases, a slight deviation from purely linear operation may be implemented to generate an optimal paragraph layout. One instance where a deviation from purely linear operation may be advantageous is where the width of the last line is less than the width of the line immediately preceding it. Referring again to FIG. 4, if a last line were associated with line 90, a deviation from purely linear operation might be necessary to generate an optimal paragraph layout because line 88 is longer than line 90. Moreover, as the difference between width of a last line and the preceding line increases, so does the potential need to deviate slightly from linear operation. A threshold difference or threshold ratio between the width of a last line and the preceding line can be defined to determine when deviation from linear operation will be applied.

[0041] The reason that a deviation from linear operation may be necessary can be understood with the following background. In some implementations, as the process considers candidate nodes in the index (e.g., the deque) for possible starts of a last line, it begins by considering the node on the bottom of the deque and considers subsequent nodes in the deque by moving upward through the deque towards the top (i.e., it begins with the node in the index that comes earliest in the reading order of the paragraph and considers subsequent nodes in the index in reading order). To increase processing speed, the system may stop considering nodes in the index as potential last line start nodes, when the line break scheme for paragraph layout associated with a particular last line start node has a penalty greater than the line break scheme for paragraph layout associated with a previously considered last line start node. In other words, as the process considers potential start nodes in the index, it may consider those nodes only as long as the line break scheme's penalty is decreasing. As soon as it increases, the process moves on to consider subsequent ending nodes. This optimization can increase processing speed.

[0042] However, when a last line is much smaller than the line immediately preceding it, implementations that include the feature described above can encounter problematic scenarios. For instance, a subsequently-considered last line start node may have an associated paragraph penalty greater than a previously considered last line start node even though the optimal line break scheme for paragraph layout was not yet found.

[0043] To handle this scenario and still realize the advantages of the above-described optimization, a process may be implemented to perform a correction function. The process can identify the potentially problematic case (e.g., a last line having a width less than the preceding line) and perform a correction function. In one implementation, the correction function forces the process to consider additional last line start nodes in the deque even though the line break scheme penalties have begun to increase. In another implementation (described in detail below), the process reconsiders nodes for which an optimal line break scheme for paragraph layout was already calculated

[0044]FIG. 7 illustrates an implementation having both a feature that increases processing speed and a correction function. As shown in FIG. 7, as the process is considering potential last line start nodes, M (140, 142, 144, 146), it may consider additional last line start nodes from the index only as long as the line break scheme's penalty is decreasing (148). In most cases, as soon as the line break scheme's penalty begins to increase, the optimal line break scheme for paragraph layout was already identified. Therefore, M(N) is defined as the start of a last line ending in node N (150) without considering additional nodes in the index as possible last line start nodes. This feature can increase processing speed.

[0045] When the calculated width of a last line ending in a particular last line start node is less than the preceding line's width (152), however, a BackUp and Redo operation (154) is performed. An example of a BackUp and Redo operation is provided in the Exemplary Pseudo-Code below. As shown in the Pseudo-Code, the BackUp and Redo operation reconsiders previously considered nodes and continues to reconsider additional previously considered nodes as long as the paragraph penalty is improving. Node N may be adjusted accordingly after a BackUp and Redo operation is performed (154).

[0046] Referring again to FIG. 4, if a calculated last line's width is associated with line 90, for example, deviating from purely linear operation allows the process to reconsider previously considered nodes to find an optimal paragraph layout. When the nodes were previously considered, only paragraphs having nodes on line 88 and the lines before line 88 were-analyzed. However, an optimal paragraph may actually place one or more previously considered nodes on short line 90. Therefore, when a shorter line 90 is identified, the previously considered nodes may be reconsidered as possible nodes ending last line 90. In this manner, the process ensures that the optimal paragraph layout is identified, and may do so deviating only slightly from purely linear operation.

[0047]FIG. 8 shows potential output following each step of an exemplary process for automated paragraph layout. FIG. 8 illustrates a hypothetical 9-node example formulated to show the dynamic operation of an implementation of the present invention.

[0048] When node 1 is considered, an optimal paragraph layout has one line containing node 1. Node 1 gets a back pointer to itself indicating the optimal start of line one. This yields a formatted paragraph ending in node 1 (see 201)

[0049] When node 2 is considered, an optimal paragraph layout may have one line beginning in node 1 and ending in node 2. Therefore, node 2 gets a back pointer to node 1 indicating the optimal start of a line ending in node two. This yields a formatted paragraph ending in node 2 (see 202).

[0050] When node 3 is considered, an optimal paragraph may have one line beginning with node 1 and ending in node 3. Therefore, node 3 gets a back pointer to node 1 indicating the optimal start of a line ending in node three. This yields a formatted paragraph ending in node 3 (see 203).

[0051] When node 4 is considered, putting node 4 on line one with nodes 1-3 may increase the penalty of line one. However, putting node 4 on line two by itself may yield an even higher paragraph penalty. Therefore, optimal paragraph layout ending in node 4 has nodes 1-4 on line one. Node 4 gets a back pointer to node 1 indicating the optimal start of a line ending in node 4. This yields a formatted paragraph ending in node 4 (see 204).

[0052] When node 5 is considered, an optimal paragraph ending in node 5 may have nodes 4-5 on line two and 1-3 on line one. Node 5 gets a back pointer to node 4 indicating the optimal start of a line ending in node 5. This yields a formatted paragraph ending in node 5 (see 205).

[0053] When node 6 is considered, an optimal paragraph ending in node 6 may have nodes 4-6 on line two and 1-3 on line one. Node 6 gets a back pointer to node 4 indicating the start of the line ending in node 6. This yields a formatted paragraph ending in node 6 (see 206).

[0054] When node 7 is considered, putting node 7 on line two with nodes 4-6 may increase the penalty significantly. Putting node 7 on line three by itself may also increase the penalty significantly. Although putting node 7 on line two with nodes 5-6 may increase the penalty of line one, it may yield the lowest cumulative penalty for the paragraph. Therefore, an optimal paragraph ending in node 7 has nodes 5-7 on line two and nodes 1-4 on line one. Node 7 gets a back pointer to node 5 indicating the optimal start of a line ending in node 7. This yields a formatted paragraph ending in node 7 (see 207). Interesting, although 205-206 have a line one with a penalty less than line one in 207, the cumulative paragraph penalty in 207 is minimized with a higher first line penalty.

[0055] When node 8 is considered, putting node 8 on line two with nodes 5-7 may increase the penalty. However, putting node 8 on line three either by itself or with node 7 may increase the penalty by an even greater amount. Thus, an optimal paragraph ending in node 8 has nodes 5-8 on line two and nodes 1-4 on line one. Node 8 gets a back pointer to node 5 indicating that the optimal start of a line ending in node 8. Node 8's back pointer, in turn defines node 4 as the last word in the previous line. This yields a formatted paragraph ending in node 8 (see 208). Again, although 206-207 have a line two with a penalty less than line two in 208, the cumulative paragraph penalty in 208 is minimized.

[0056] Finally, when node 9 is considered, putting node 9 on line three by itself may not increase the penalty of line three. However, putting node 7, 8 and 9 on line three may yield the lowest cumulative penalty. Therefore, optimal paragraph ending in node 9 has nodes 7-9 on line three. Node 9 gets a back pointer to node 7 indicating that the optimal start of a line ending in node 9 is node 7. Node 6's back pointer, in turn, defines the layout of lines two and one. This yields a formatted paragraph ending in node 9 (see 209).

[0057] The pseudo-code in the table below illustrates one exemplary implementation of the invention. EXEMPLARY PSEUDO-CODE Variables: Nodes = array of nodes of paragraph (e.g., syllables) in reading order S = deque, used to hold indexes of candidate nodes during processing n = number of nodes in paragraph f = array of cumulative penalty values (one per node) previousLineEnd = array of indexes of node that ends previous line (one per node) Functions: |S| = current cardinality of S Top = value of the top element of S Bottom = value of the bottom element of S 2Top = value of the second from the top element of S 2Bottom = value of the second from the bottom element of S LineWidth(i, j) = width of line from i+1 node through j node (sum of width of nodes+ right adjustment of final node to account for hyphenation, trailing spaces, etc.) Height(i,j) = maximum of height[i+1], . . . , height[j]; where i < j Penalty(i, j) // Calculates total penalty of paragraph with optimal line breaks ending // with the line i+1, j. if (j == n) and (LineWidth(i,j) <= TargetWidth(i,j) then // This “if” is for the typical case where the last line in a paragraph // can be of any length (less than the target width. To achieve // forced justification of the last line in the paragraph, remove the // “if-side” of this conditional. Penalty = f(i) else // This is a fairly arbitrary choice for a penalty function. A // typographically rich penalty function would take into account // many other factors e.g., hyphen ladders ranked hyphenation // points, short/long-ness of previous line, preferred length of last // line in paragraph, additional penalty for hyphenating last line on // a page, etc.) Penalty = 10 * (TargetWidth(i,j) − LineWidth(i,j))**2 + f(i) (+25, if node(j) ends with hyphen) MaxTargetWidth(i,j) = 2 * TargetWidth(i,j) The 2 constant is arbitrary. In an environment where a user can choose different paragraph alignments and specify min, max, desired amounts for variables like letter and word spacing, this value would be a function of those inputs. MinTargetWidth(i,j) = TargetWidth(i,j) / 3 The “3” constant is arbitrary. In an environment where a user can choose different paragraph alignments and specify min, max, desired amounts for variables like letter and word spacing, this value would be a function of those inputs. TargetWidth(i,j) For a rectangular shape, this just returns the constant width of the rectangle. For a complex shape, it returns the width of a rectangle of Height(i,j) that is of the maximum width fully contained in the complex shape and is positioned with its top at the y offset of the preceding (i th) node, y[i]. BackupAndRedo(i) This function is used to correct a situation caused by composing a narrow line after a wide line. The basic algorithm does not handle this case well. The function is specified below. Procedures: Pop - delete the top element of S Drop - delete the bottom element of S Push(x) - insert x at the top of S Main Process: f[0] = 0 S = empty list startOfLine = 0 for i from 1 up to n do begin while S nonempty and LineWidth(Bottom, i)> MaxTargetWidth(Bottom, i) do Drop while LineWidth(startOfLine, i)>= MinTargetWidth(startOfLine, i) do begin while S nonempty and Penalty(startOfLine, i)<= Penalty(Top, i) do Pop if LineWidth(startOfLine, i)<= MaxTargetWidth(startOfLine, i) then Push(startOfLine) startOfLine = startOfLine + 1 end while |S| >= 2 begin if Penalty(2Bottom, i)<= Penalty(Bottom, i) then Drop else if TargetWidth(2Bottom, i) < TargetWidth(Bottom, i) then BackupAndRedo(i) end if S nonempty then begin previousLineEnd[i] = Bottom f[i] = Penalty(Bottom, i) y[i] = Height(Bottom, i) + y[Bottom - 1] end else begin prevousLineEnd[i] = 0 f[i] = infinity y[i] = Height(0,i) end end // n is the last node of the paragraph if f[n] < infinity then begin x = n while x != 0 // while not at the beginning of the paragraph begin composeLines.ApplyComposedLine(previousLineEnd[x] + 1, x) // print/draw/save the line consisting of // the nodes from (previousLineEnd[x] + 1) to (x) x = previousLineEnd[x] // back up to previous line end end // ---------------------------------------------------------------------- function BackupAndRedo(i) begin newPenalty = Penalty(Bottom, i) // backup as long as the penalty is better starting on the next line // and do not backup before the beginning. while (i > 2Bottom) do begin lastPenalty = newPenalty; newPenalty = Penalty(2Bottom, i − 1) if newPenalty < lastPenalty i = i − 1; else break out of while loop end if i was decremented begin Drop // do not count Bottom anymore while (Top >= i) // everything from i on is to be redone Pop startOfLine = Top − 1; end end

[0058] One problem that arises as a result of the dynamic features of the present invention relates to hyphenation and spacing at the end of a line. The ending nodes of the respective lines in the paragraph are not defined until the process has considered every node in the paragraph. For this reason, the width of one or more nodes that may end a given line may also be uncertain until the process has been completed. If a hyphenated word ends a line, a particular node will have a hyphen that increases the width of that node. However, if that particular node does not end the line, its width will not be increased by the presence of a hyphen. The presence or absence of the hyphen will, in part, determine the width of the particular node. Moreover, that particular node's width may affect the optimal paragraph layout.

[0059] Similarly, a node that ends a word may have a node width that accounts for the spacing between that word and the following word. However, if the node that ends a word also ends a line, the node width should not account for any spacing. For these reasons, a process in accordance with the invention may dynamically account for one or more node's widths. These respective widths can then be used as the process calculates the appropriate penalty values to determine an optimal paragraph layout. In this manner, the optimal paragraph layout will be defined using the appropriate nodes' widths whether or not the nodes that end particular lines change during the dynamic process.

[0060]FIG. 9 illustrates an implementation of a process that accounts for one or more potentially varying node widths. As shown, a base node width associated with a node is calculated (230). For instance, the base node width may include character width components that take into account the widths of the respective characters that make up the node. In addition, the base node width may include additional components such as a kern pair component to account for variations in node widths that result when particular characters follow one another. For instance, in the English language when a capital A follows a capital W, e.g., “WA,” a relatively large kern pair component may downwardly adjust the node width because the respective widths of the characters W and A overlap.

[0061] In addition to calculating a base node width, a correction width is also calculated (232). This correction width may account for one or more adjustments that should be accounted for when the node ends a line. For instance, the correction width may include a space adjustment component to ensure proper justification. If a last node of a word ends a line, the additional space following that word should not be considered as part of the last node's width, or improper justification of the line will occur. For this reason, the space adjustment component reduces the width of a node by the width of a space when that node is both the last node in a word and the last node in a line.

[0062] The correction width may also include a hyphenation adjustment component to adjust the node's width when that node is the hyphenated node of a hyphenated word. For instance, the node's width may be increased by the width of the hyphen and decreased to account for any kern pair adjustment involving the last character of the node and the hyphen.

[0063] After calculating a base node width and a correction width, the proper width may be used depending on where the node resides on a given line. If the node ends a line in the paragraph (yes branch of 234), a combination of the base node width and the correction width is used as the width of the node (236). However, if the node does not end a line in the paragraph (no branch of 234), then the base node width is used as the width of the node (238).

[0064] The notion of using a correction width can also be used to account for a beginning of a line adjustment, e.g., for a node that begins a line. If a node begins a line, the width of that node may require adjustment to account for justification. For instance, some paragraph layouts use what is referred to as “hanging punctuation.” In layouts using hanging punctuation, if punctuation begins a line, the line is justified slightly so that the character following the punctuation is placed where the first character of the line normally is placed. For instance, if the node “One” began a line, the character “O” might be positioned one inch from the left side of the page. However, if the node “One” began the line, the character ““” may be justified to the left so that the character “O” was still positioned one inch from the left side of the page. The same correction technique illustrated in FIG. 9 could be used to dynamically define the width of nodes that begin a line. However, step 234 in FIG. 9 would be changed to ask whether the node begins a line.

[0065] Similarly, optical edge adjustment techniques may require that the widths of beginning nodes of lines in a paragraph be defined using a process similar to that in FIG. 9. Optical edge adjustment techniques recognize that justifying some particular characters slightly, can enhance the visual perception of the layout. For instance, if the character “L” is placed at the beginning of a line, it might be placed one inch from the left side of the page. However, the character “W” may appear to be indented slightly if it begins a line and is placed one inch from the left side of the page. Therefore, the character “W” may be placed, e.g., 0.97 inches from the left side of the page rather than one inch. If this is the case, a correction technique similar to that illustrated in FIG. 9 may be implemented to adjust the width of the node containing, e.g., the character “W”, when that node begins a line.

[0066] The base node widths may simply define the widths of given nodes without any corrections (i.e., the width of the base node can be the width from the beginning of the node to the end of the node). Alternatively, the base node widths may define the widths in terms of the distance from the beginning of the text to the end of the given node. For instance, if each node's base width is defined in terms of the distance from the beginning of the text, line length calculations may be simplified. If each node's base width is defined in terms of the distance from the beginning of the text, the base length of the text on a current line can be calculated, e.g., simply by subtracting the width of the last node of the current line from the width of the node that ends the line immediately preceding the current line.

[0067] In one particular implementation, the process starts with a list of character widths and kern pair adjustments. These respective widths are then used to calculate potential left pieces and potential right pieces of a given word. Then, the width of potential end nodes are calculated. For instance the word “kangaroo_” would have a start list of characters {k, a, n, g, a, r, o, -, <space>} each having a defined width, and a list of kern pairs {ka, an, ng, ga, ar, ro, oo, n-, a-} each having a defined kern pair adjustment. These variables are used to calculate the widths of potential left pieces {kan-, kanga-} and potential right pieces {garoo_, roo_}. Moreover, the potential end nodes of a line {kan-, ga-, roo} can be calculated using combinations of the variables mentioned above and combinations of the calculations mentioned above. At this point, sufficient data is available for a system to dynamically define the width of the given nodes in the word “kangaroo_” whether or not any of the nodes are positioned at the end of a line.

[0068] After dynamically defining the node widths, the calculated widths and calculated correction widths can be used to calculate the length of a line of text. The first node in the line of text has a width corresponding to its base node width plus the adjustment width that accounts for the fact that the node is beginning a line. The last node in the line of text has a width corresponding to its base node width plus the adjustment width that accounts for the fact that the node is ending a line. The rest of the nodes in the line simply have widths corresponding to their respective base node widths. Thus, the length of the whole line can be calculated simply by summing the respective widths used for the respective nodes of the line. Alternatively, if the base widths are defined in terms of the distance from the beginning of the text, the width of the whole line can be calculated by starting with the base width of the node ending a line, adding the ending correction component for that node that ends the line (or subtracting the component depending on how the correction component is defined), subtracting the width of the node that ends the previous line, and adding the beginning correction component of the node that begins the line (again, or subtracting the component depending on how the correction component is defined).

[0069] Other implementations operate in a similar manner according to break rules that define how characters should be laid out in a particular language. For example, warichu is a Japanese way of laying out a collection of characters in a small grid according to specific break rules. The invention can be implemented to reflect the break rules of warichu, for instance, to improve automated paragraph layout in Japanese. Moreover, in some languages, such as German, hyphenation may cause spelling changes in the nodes of the hyphenated word. The invention can be implemented to reflect these grammatical rules as well.

[0070] Still additional challenges arise in automated paragraph layout when lines of a paragraph cell are broken into more than one tile. FIGS. 10-12, for instance, illustrate three different exemplary paragraph cells 260, 280, and 300 that contain lines that are broken into more than one tile. In FIG. 10, paragraph cell 260 contains lines 262, 264, 266, 268, 270, 272 and 274. Line 262 is broken into tiles 262 a and 262 b. Line 264 is broken into tiles 264 a and 264 b. Line 266 is broken into tiles 266 a and 266 b, and line 268 is broken into tiles 268 a and 268 b.

[0071] In FIG. 11, paragraph cell 280 contains lines 282, 284, 286, 288, 290, 292, 294, 296 and 298. These lines are arranged around island 299. Line 288 is broken into tiles 288 a and 288 b. Line 290 is broken into tiles 290 a and 290 b, and line 292 is broken into tiles 292 a and 292 b. Island 299, for instance may define an area for placement of an image or other text.

[0072] In FIG. 12, paragraph cell 300 contains lines 302, 304, 306, 308, 310, 312, 314, 316, 318, 320, 322, and 324. Line 302 is broken into tiles 302 a, 302 b, 302 c and 302 d. Line 304 is broken into tiles 302 a, 302 b, 302 c and 302 d. Line 306 is broken into tiles 306 a, 306 b, 306 c and 306 d. Line 308 is broken into tiles 308 a, 308 b, 308 c and 308 d, and line 310 is broken into tiles 310 a, 310 b, 310 c, 310 d. Line 322 is broken into tiles 322 a and 322 b, and line 324 is broken into tiles 322 a and 322 b.

[0073] Conventionally, if a line is broken into multiple tiles, those tiles are analyzed as though they were individual lines. For instance, a line-by-line technique would define the content of each tile, and then move on to the next. A tree-structure technique would similarly treat each tile as a line of text when choosing the optimal path through the tree, and similarly, dynamic algorithms would treat each tile as a line.

[0074] The conventional approach of treating each tile as a separate line, however, poses problems for all of these techniques. For instance, composing one tile at a time can present problems when the height of characters changes. As mentioned above, the height and shape of the characters positioned within the paragraph cell define the respective heights of the different lines in that cell. In other words, any given line must have a height at least as tall as the tallest character in that line. Line 310, for instance, in FIG. 11 illustrates a line with a height greater than the other lines in cell 300. As a given technique analyzes nodes in the reading order of a paragraph, the line's height may need to be increased if a particularly tall character is encountered. For instance, a first node in a line may have 10-point font characters while a second or third node in that same line may have 14-point font characters. When the process encounters the first node, the line only needs to be tall enough to hold 10-point font characters. However, when the process encounters that later node having 14-point font characters, the height of the whole line must change.

[0075] Thus, if individual tiles are analyzed as though they were individual lines, when a taller character is encountered, the process may need to back up indefinitely until it reaches the first tile of a given line. This can be inefficient or even ineffective.

[0076] For these reasons, when a multi-tile line is encountered it is analyzed as a single line with multiple tiles and not a collection of different lines. FIG. 13 is a flow diagram illustrating an exemplary implementation for analyzing a paragraph that has at least one multi-tile line. The process shown in FIG. 13 may form part of a larger process for automated paragraph layout. For instance, a line-by-line technique, a tree structure technique, or a dynamic technique could all implement the process in FIG. 13 to improve the line layout of a line that has multiple tiles.

[0077] As shown in FIG. 13, the process considers whether a single line contains multiple tiles (350). If it does not (352), then the line is analyzed using the normal approach for whichever paragraph layout technique is being implemented (e.g., a line-by-line technique, a tree structure technique, or a dynamic technique). If, however, a single line does contain multiple tiles, then that line is analyzed using a multi-tile line approach (354).

[0078]FIG. 14 is a flow diagram illustrating an exemplary implementation for analyzing a multi-tile line. Again, multi-tile lines may be encountered in a number of different paragraph layout techniques. Thus, the process of FIG. 14 may form part of a larger process for automated paragraph layout. In general, any process where a defined number of nodes are received to be laid out on multiple tiles may implement the process of FIG. 14.

[0079] In the process shown in FIG. 14, a defined number of nodes are received (359). For instance, a larger process for paragraph layout may receive the defined number of nodes to be considered for layout on a given line. Once the nodes are received, a number of different candidate line penalties for the line are calculated (360). Each of these respective candidate line penalties is associated with a unique line layout. In other words, for each different candidate line penalty that is calculated, the nodes of the line are positioned on the different tiles to define a unique line layout for that line. Then, once the candidate line penalties have been calculated, the penalty for the multi-tile line having the defined number of nodes is determined according to the candidate line penalty that has the lowest value (362).

[0080] An additional process may be implemented to facilitate the defining of different unique line layouts for which line penalties are calculated. One such exemplary process is described below.

[0081] The first unique line layout for an N-node line having T tiles has a defined number of nodes positioned on each tile. The defined number may be arbitrarily chosen as the starting point of the process. By way of example, the defined number may be chosen to be N/T so that an equal number of nodes are initially positioned in each tile. If N/T is not an integer, a rounding technique may be used to define the first unique line layout. The process may then consider every possible unique layout where X nodes are removed from one of the tiles and repositioned in a different tile. By way of example, let X=4, then one tile will have N/T−4 nodes and a different tile will have N/T+4 nodes. After all possible movements of X nodes have been considered, the process determines whether any of the unique line layouts have a lower penalty than the first unique line layout. If so, the process continues by removing an additional X nodes from a tile within the unique line layout with the lowest penalty. Again, if this improves the line penalty, still an additional X nodes are removed, and the process continues to repeat itself until a line is defined such that removing an additional X nodes from a tile does not improve the penalty.

[0082] The process then performs similar steps on the unique line layout that has thus far yielded the lowest penalty. However, this time X−1 nodes are removed from a tile and repositioned in a different tile. Again, X−1 nodes are removed in a repeated process until the line is defined such that removing an additional X−1 nodes from a tile does not improve the line penalty.

[0083] The process then performs similar steps on the respective unique line layouts that have yielded the lowest respective penalties. X−2 nodes are removed from a tile and repositioned until removing an additional X−2 nodes from a tile does not improve the penalty. Then X−3 nodes are removed and repositioned, and then X−4, and so forth. Eventually, a unique line layout is considered where an additional 1 node is removed from a tile and repositioned in a different tile. At this point, once the process of removing 1 node and repositioning the 1 node has been carried out, the unique line layout that yields the lowest penalty is the optimal multi-tile line. The optimal multi-tile line ending in a particular node is therefore defined as the unique line layout that yielded the lowest penalty.

[0084] In the example above, X was defined as 4. However, X may be defined as any number. For instance, X may be initially defined as 1, and the subsequent “similar steps” may be performed by incrementing X rather than decrementing X. Moreover, the adjustments to X do not have to be incrementing or decrementing, or even linear. In another implementation, for example, X is originally defined as 5, then 3, and then 1. In another implementation, X is originally defined as 6, then 4, then 3, then 2, and then 1. In still another implementation, X is originally defined as 6, then 1, then 4, then 1 again, then 2, and then 1 again.

[0085] First defining X as the largest number of nodes that will be repositioned, and then reducing X for the subsequent steps, is advantageous because it avoids local maximums, and tends to ensure that the optimal layout is discovered. Thus, in general X may be initially defined as a relatively large number so that a relatively large number of nodes may be repositioned early in the process. Then, the number of nodes that are repositioned in subsequent steps may be relatively smaller than the original X. In this manner, local maximums may be avoided.

[0086] A system suitable for implementation of techniques for automated paragraph layout can include a processor, user input device, display monitor, memory, storage device, and printer. The system may substantially conform to conventional systems used by graphic artists and other users in the creation of textual and graphic imagery for electronic display or print reproduction. A memory/bus controller and system bus couple processor and memory, while one or more I/O controllers and I/O bus couple the processor and memory to user input device, display monitor, storage device, and printer.

[0087] The processor may take the form of a general purpose microprocessor and can be integrated with or form part of a PC, Macintosh, computer workstation, hand-held data terminal, palm computer, cell phone, digital paper, or the like. The user input device may include a conventional keyboard and pointing device such as a mouse, pen, or trackball, if desired. The monitor may include a CRT, flat panel display, or the like, that displays textual and/or graphic information to the user. The memory may include random access memory (RAM) storing program code that is accessed and executed by processor to carry out techniques for automated paragraph layout.

[0088] The program code can be loaded into the memory from a storage device, which may take the form of a fixed hard drive or removable media drive associated with the system. For example, the program code can be initially carried on computer-readable media such as magnetic, optical, magneto-optic or other disk or tape media. Alternatively, the program code may be loaded into memory from electronic computer-readable media such as EEPROM, or downloaded over a network connection. The program code may be embodied as a feature in an application program providing a wide range of page layout and content authoring functionality.

[0089] A number of implementations of the present invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For instance, unbreakable segments of characters (nodes) could be defined in any manner. A node could be a syllable, a word, particular words, a character, a symbol, or any combination or any other collection of characters that, for whatever reason, are defined as unbreakable. Accordingly, other implementations and embodiments are within the scope of the following claims. 

What is claimed is:
 1. A method comprising: beginning with a first node in the reading order of a paragraph, calculating an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme.
 2. The method of claim 1, the method further comprising: maintaining an index of possible start nodes of the current line, and for at least one node in the paragraph, adjusting the index prior to calculating an optimal line break scheme for a paragraph layout that ends with that one node.
 3. The method of claim 2, wherein the index is maintained in a queue.
 4. The method of claim 2, the method further comprising: for every subsequent node in the paragraph, adjusting the index prior to calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node.
 5. The method of claim 2, the method further comprising: for at least one node in the paragraph, calculating a width of a current line prior to calculating an optimal line break scheme for a paragraph layout that ends with that one node and after adjusting the index.
 6. The method of claim 4, the method further comprising: for every subsequent node in the paragraph, calculating a width of the current line prior to calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node and after adjusting the index.
 7. The method of claim 5, the method further comprising: for at least one node in the paragraph, re-calculating an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is less than a width of a line immediately preceding it.
 8. The method of claim 5, the method further comprising: for at least one node in the paragraph, re-calculating an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is a defined amount less than a width of a line immediately preceding it.
 9. The method of claim 1, the method further comprising: formatting the paragraph in accordance with the optimal line break scheme of a last node in the paragraph.
 10. The method of claim 1, the method further comprising: repeating the method for each of a finite number of paragraphs.
 11. A computer-readable medium carrying program code that, when executed: begins with a first node in the reading order of a paragraph, calculates an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculates an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme.
 12. The computer readable medium of claim 11, the medium further carrying program code that, when executed: maintains an index of possible start nodes of the current line, and for at least one node in the paragraph, adjusts the index prior to calculating an optimal line break scheme for a paragraph layout that ends with that one node.
 13. The computer readable medium of claim 12, wherein the index is maintained in a queue.
 14. The computer readable medium of claim 12, the medium further carrying program code that, when executed: for every subsequent node in the paragraph, adjusts the index prior to calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node.
 15. The computer readable medium of claim 12, the medium further carrying program code that, when executed: for at least one node in the paragraph, calculates a width of the current line prior to calculating an optimal line break scheme for a paragraph layout that ends with that one node and after adjusting the index.
 16. The computer readable medium of claim 14, the medium further carrying program code that, when executed: for every subsequent node in the paragraph, calculates a width of the current line prior to calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node and after adjusting the index.
 17. The computer readable medium of claim 15, the medium further carrying program code that, when executed: for at least one node in the paragraph, re-calculates an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is less than a width of a line immediately preceding it.
 18. The computer readable medium of claim 15, the medium further carrying program code that, when executed: for at least one node in the paragraph, re-calculates an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is a defined amount less than a width of a line immediately preceding it.
 19. The computer readable medium of claim 11, the medium further carrying program code that, when executed: formats the paragraph in accordance with the optimal line break scheme of a last node in the paragraph.
 20. The computer readable medium of claim 11, the medium further carrying program code that, when executed: repeats its execution for each of a finite number of paragraphs.
 21. A system comprising a user input device, a display, a memory device, and a processor programmed to: begin with a first node in the reading order of a paragraph, calculate an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculate an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme.
 22. The system of claim 21, the processor further programmed to: maintain an index of possible start nodes of the current line, and for at least one node in the paragraph, adjust the index prior to calculating an optimal line break scheme for a paragraph layout that ends with that one node.
 23. The system of claim 22, wherein the index is maintained in a queue.
 24. The system of claim 22, the processor further programmed to: for every subsequent node in the paragraph, adjust the index prior to calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node.
 25. The system of claim 22, the processor further programmed to: for at least one node in the paragraph, calculate a width of the current line prior to calculating an optimal line break scheme for a paragraph layout that ends with that one node and after adjusting the index.
 26. The system of claim 24, the processor further programmed to: for every subsequent node in the paragraph, calculate a width of the current line prior to calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node and after adjusting the index.
 27. The system of claim 25, the processor further programmed to: for at least one node in the paragraph, re-calculate an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is less than a width of a line immediately preceding it.
 28. The system of claim 25; the processor further programmed to: for at least one node in the paragraph, re-calculate an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is a defined amount less than a width of a line immediately preceding it.
 29. The system of claim 21, the processor further programmed to: format the paragraph in accordance with the optimal line break scheme of a last node in the paragraph.
 30. The system of claim 21, the processor further programmed to: repeat its processing for each of a finite number of paragraphs.
 31. A method comprising: maintaining an index of candidate start nodes of a current line; beginning with a first node in the reading order of a paragraph, adjusting the index, calculating a width of the current line, and calculating an optimal line break scheme for a paragraph layout that ends with the first node, the optimal line break scheme having a last line that begins with one of the candidate start nodes; for every subsequent node in the reading order of the paragraph, adjusting the index, calculating the width of the current line, and calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node, each optimal line break scheme having a last line that begins with one of the candidate nodes; and formatting the paragraph in accordance with the optimal line break scheme of a last node in the paragraph.
 32. The method of claim 31, the method further comprising: for at least one node in the paragraph, re-calculating an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is a less than a width of a line immediately preceding it.
 33. A computer-readable medium carrying program code that, when executed: maintains an index of candidate start nodes of a current line, begins with a first node in the reading order of a paragraph, adjusts the index, calculates a width of the current line, calculates an optimal line break scheme for a paragraph layout that ends with the first node, the optimal line break scheme having a last line that begins with one of the candidate start nodes; for every subsequent node in the reading order of the paragraph, adjusts the index, calculates the width of the current line, and calculates an optimal line break scheme for a paragraph layout that ends with that subsequent node, each optimal line break scheme having a last line that begins with one of the candidate nodes; and formats the paragraph in accordance with the optimal line break scheme of a last node in the paragraph.
 34. The computer readable medium of claim 33, the medium further carrying program code that, when executed: for at least one node in the paragraph, re-calculates an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is a less than a width of a line immediately preceding it.
 35. A system comprising a user input device, a display, a memory device, and a processor programmed to: maintain an index of candidate start nodes of a current line, begin with a first node in the reading order of a paragraph, adjust the index, calculate a width of the current line, calculate an optimal line break scheme for a paragraph layout that ends with the first node, the optimal line break scheme having a last line that begins with one of the candidate start nodes; for every subsequent node in the reading order of the paragraph, adjust the index, calculate the width of the current line, and calculate an optimal line break scheme for a paragraph layout that ends with that subsequent node, each optimal line break scheme having a last line that begins with one of the candidate nodes; and format the paragraph in accordance with the optimal line break scheme of a last node in the paragraph.
 36. The system of claim 35, the processor further programmed to: for at least one node in the paragraph, re-calculate an optimal line break scheme for paragraph layout that ended in that one node, when the width of the current line is a less than a width of a line immediately preceding it.
 37. A method of processing text that is divided into nodes, each node defining an unbreakable segment of characters comprising: calculating a base node width associated with a node, calculating a correction width, using the base node width as the width of the node when calculating a length of a line when the node does not end the line, and using a combination of the base node width and the correction width as the width of the node when calculating the length of the line when the node ends the line.
 38. The method of claim 37, wherein the base node width is defined in terms of a distance from a beginning of the text to an end of the node.
 39. The method of claim 37, wherein the base node width is defined in terms of a distance from a beginning of the node to an end of the node.
 40. The method of claim 37, wherein calculating the base node width comprises adding character width components to kern pair components
 41. The method of claim 37, wherein calculating the correction width includes accounting for the absence of a space.
 42. The method of claim 37, wherein calculating the correction width includes accounting for the width of a hyphen.
 43. A method of processing text that is divided into nodes, each node defining an unbreakable segment of characters comprising: beginning with a first node in the reading order of a paragraph, calculating an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme, and wherein calculating the optimal line break schemes includes calculating base node widths associated with the nodes, calculating correction widths, using a given base node width as the width of a given node when calculating a length of a given line when the given node does not end the given line, and using a combination of the given base node width and one of the correction widths as the width of the given node when calculating the length of the given line when the given node ends the given line.
 44. A method comprising: calculating a base node width associated with a node, the base node width including at least one character component and at least one kern pair component, calculating a correction width, the correction width including a space adjustment component and a hyphenation adjustment component, using the base node width as the width of the node when calculating a length of a line when the node does not end the line, and using a combination of the base node width and the correction width as the width of the node when calculating the length of the line when the node ends the line.
 45. A method of processing text that is divided into nodes, each node defining an unbreakable segment of characters comprising: calculating a base node width associated with a node, calculating a correction width, using the base node width as the width of the node when calculating a length of a line when the node does not begin the line, and using a combination of the base node width and the correction width as the width of the node when the node begins the line.
 46. A method of processing text that is divided into nodes, each node defining an unbreakable segment of characters comprising: for each node, calculating a base node width associated with the node, for each node, calculating a first correction width associated with the node if the node ends a line, for each node, calculating a second correction width associated with the node if the node begins a line, and calculating a length of a line consisting of a sequence of nodes, the calculated length being equal to the total sum of base node widths for the nodes in the sequence, plus the first correction width associated with a last node in the sequence of nodes, plus the second correction width associated with a first node in the sequence of nodes.
 47. A computer-readable medium carrying program code that, when executed in a system of processing text that is divided into nodes, each node defining an unbreakable segment of characters: calculates a base node width associated with a node, calculates a correction width, uses the base node width as the width of the node when calculating a length of a line when the node does not end the line, and uses a combination of the base node width and the correction width as the width of the node when calculating the length of the line when the node ends the line.
 48. The computer-readable medium of claim 47, wherein the base node width is defined in terms of a distance from a beginning of the text to an end of the node.
 49. The computer-readable medium of claim 47, wherein the base node width is defined in terms of a distance from a beginning of the node to an end of the node.
 50. A computer-readable medium carrying program code that, when executed in a system of processing text that is divided into nodes, each node defining an unbreakable segment of characters: begins with a first node in the reading order of a paragraph, calculates an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculates an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme, and wherein calculating the optimal line break schemes includes calculating base node widths associated with the nodes, calculating correction widths, using a given base node width as the width of a given node when calculating the length of a given line when the given node does not end the given line, and using a combination of the given base node width and one of the correction widths as the width of the given node when calculating the length of the given line when the given node ends the given line.
 51. A computer-readable medium carrying program code that, when executed: calculates a base node width associated with a node, the base node width including at least one character component and at least one kern pair component, calculates a correction width, the correction width including a space adjustment component and a hyphenation adjustment component, uses the base node width as the width of the node when calculating a length of a line when the node does not end the line, and uses a combination of the base node width and the correction width as the width of the node when calculating the length of the line when the node ends the line.
 52. A computer-readable medium carrying program code that, when executed in a system of processing text that is divided into nodes, each node defining an unbreakable segment of characters: calculates a base node width associated with a node, calculates a correction width, uses the base node width as the width of the node when calculating a length of a line when the node does not begin the line, and uses a combination of the base node width and the correction width as the width of the node when the node begins the line.
 53. A computer-readable medium carrying program code that, when executed in a system of processing text that is divided into nodes, each node defining an unbreakable segment of characters: for each node, calculates a base node width associated with the node, for each node, calculates a first correction width associated with the node if the node ends a line, for each node, calculates a second correction width associated with the node if the node begins a line, and calculates a length of a line consisting of a sequence of nodes, the calculated length being equal to the total sum of base node widths for the nodes in the sequence, plus the first correction width associated with a last node in the sequence of nodes, plus the second correction width associated with a first node in the sequence of nodes.
 54. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to process text that is divided into nodes, each node defining an unbreakable segment of characters, the processor further programmed to: calculate a base node width associated with a node, calculate a correction width, use the base node width as the width of the node when calculating a length of a line when the node does not end the line, and use a combination of the base node width and the correction width as the width of the node when calculating the length of the line when the node ends the line.
 55. The system of claim 54, wherein the base node width is defined in terms of a distance from a beginning of the text to an end of the node.
 56. The system of claim 54, wherein the base node width is defined in terms of a distance from a beginning of the node to an end of the node.
 57. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to process text that is divided into nodes, each node defining an unbreakable segment of characters, the processor further programmed to: begin with a first node in the reading order of a paragraph, calculate an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculate an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme, and wherein calculating the optimal line break schemes includes calculating base node widths associated with the nodes, calculating correction widths, using a given base node width as the width of a given node when calculating a length of a given line when the given node does not end the given line, and using a combination of the given base node width and one of the correction widths as the width of the given node when calculating the length of the given line when the given node ends the given line.
 58. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to: calculate a base node width associated with a node, the base node width including at least one character component and at least one kern pair component, calculate a correction width, the correction width including a space adjustment component and a hyphenation adjustment component, use the base node width as the width of the node when calculating a length of a line when the node does not end the line, and use a combination of the base node width and the correction width as the width of the node when calculating the length of the line when the node ends the line.
 59. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to process text that is divided into nodes, each node defining an unbreakable segment of characters, the processor further programmed to: calculate a base node width associated with a node, calculate a correction width, use the base node width as the width of the node when calculating a length of a line when the node does not begin the line, and use a combination of the base node width and the correction width as the width of the node when the node begins the line.
 60. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to process text that is divided into nodes, each node defining an unbreakable segment of characters, the processor further programmed to: for each node, calculate a base node width associated with the node, for each node, calculate a first correction width associated with the node if the node ends a line, for each node, calculate a second correction width associated with the node if the node begins a line, and calculate a length of a line consisting of a sequence of nodes, the calculated length being equal to the total sum of base node widths for the nodes in the sequence, plus the first correction width associated with a last node in the sequence of nodes, plus the second correction width associated with a first node in the sequence of nodes.
 61. A method comprising: receiving N nodes to be laid out on multiple tiles on a same line, calculating candidate line penalties for the line, each candidate line penalty being associated with a unique line layout of nodes positioned in the tiles; and determining a line penalty of the N-node line as the candidate line penalty having a lowest value.
 62. The method of claim 61, wherein a first calculated line penalty is associated with a first line layout in which one of the tiles contains an initial number of the N nodes, and a second calculated line penalty is associated with a second line layout in which the one of the tiles contains the defined number of the N nodes minus a specified number.
 63. The method of claim 61, wherein the N-node line has T tiles, and wherein a first calculated line penalty is associated with a line layout in which each tile contains a number of nodes equal to N/T rounded to the nearest integer.
 64. The method of claim 63, wherein a second calculated line penalty is associated with a line layout in which a first tile has N/T rounded to the nearest integer minus 4 nodes and a second tile has N/T rounded to the nearest integer plus 4 nodes.
 65. The method of claim 61, wherein the method is repeated for each multi-tile line in a paragraph.
 66. A method comprising: receiving N nodes to be laid out on multiple tiles on a same line, calculating candidate line penalties for the line, each candidate line penalty being associated with a unique line layout of nodes positioned in the tiles; and defining the line as the line layout associated with the lowest candidate line penalty.
 67. A method comprising: beginning with a first node in the reading order of a paragraph, calculating an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculating an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme, and wherein, if the current line is a multi-tile line, calculating an optimal line break scheme includes calculating line penalties for the current line, each line penalty being associated with a unique line layout of nodes positioned in the tiles.
 68. A method comprising: receiving N nodes to be laid out on multiple tiles on a same line, laying out the N nodes in the tiles and calculating a candidate line penalty, repositioning some of the N nodes from one of the tiles to another one of the tiles, and calculating additional candidate line penalties, and determining a line penalty of the line as the candidate line penalty having a lowest value.
 69. The method of claim 68, wherein repositioning some of the N nodes comprises repositioning a first number the nodes until doing so does not improve candidate line penalties, and repositioning a second number of the nodes until doing so does not improve candidate line penalties, wherein the first number is larger than the second number.
 70. A computer-readable medium carrying program code that, when executed by a computer: receives N nodes to be laid out on multiple tiles on a same line, calculates candidate line penalties for the line, each candidate line penalty being associated with a unique line layout of nodes positioned in the tiles, and determines a line penalty of the N-node line as the candidate line penalty having a lowest value.
 71. The computer-readable medium of claim 70, wherein a first calculated line penalty is associated with a first line layout in which one of the tiles contains an initial number of the N nodes, and a second calculated line penalty is associated with a second line layout in which the one of the tiles contains the defined number of the N nodes minus a specified number.
 72. The computer-readable medium of claim 70, wherein the N-node line has T tiles, and wherein a first calculated line penalty is associated with a line layout in which each tile contains a number of nodes equal to N/T rounded to the nearest integer.
 73. The computer-readable medium of claim 72, wherein a second calculated line penalty is associated with a line layout in which a first tile has N/T rounded to the nearest integer minus 4 nodes and a second tile has N/T rounded to the nearest integer plus 4 nodes.
 74. The computer-readable medium of claim 70, wherein the execution is repeated for each multi-tile line in a paragraph.
 75. A computer-readable medium carrying program code that, when executed by a computer: receives N nodes to be laid out on multiple tiles on a same line, calculates candidate line penalties for the line, each candidate line penalty being associated with a unique line layout of nodes positioned in the tiles; and defines the line as the line layout associated with the lowest candidate line penalty.
 76. A computer-readable medium carrying program code that, when executed by a computer: begins with a first node in the reading order of a paragraph, calculates an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculates an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme, and wherein, if the current line is a multi-tile line, calculating an optimal line break scheme includes calculating line penalties for the current line, each line penalty being associated with a unique line layout of nodes positioned in the tiles.
 77. A computer-readable medium carrying program code that, when executed by a computer: receives N nodes to be laid out on multiple tiles on a same line, lays out the N nodes in the tiles and calculates a candidate line penalty, repositions some of the N nodes from one of the tiles to another one of the tiles, and calculates additional candidate line penalties, and determines a line penalty of the line as the candidate line penalty having a lowest value.
 78. The computer-readable medium of claim 77, wherein repositioning some of the N nodes comprises repositioning a first number the nodes until doing so does not improve candidate line penalties, and repositioning a second number of the nodes until doing so does not improve candidate line penalties, wherein the first number is larger than the second number.
 79. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to: receive N nodes to be laid out on multiple tiles on a same line, calculate candidate line penalties for the line, each candidate line penalty being associated with a unique line layout of nodes positioned in the tiles; and determine a line penalty of the N-node line as the candidate line penalty having a lowest value.
 80. The system of claim 79, wherein a first calculated line penalty is associated with a first line layout in which one of the tiles contains an initial number of the N nodes, and a second calculated line penalty is associated with a second line layout in which the one of the tiles contains the defined number of the N nodes minus a specified number.
 81. The system of claim 79, wherein the N-node line has T tiles, and wherein a first calculated line penalty is associated with a line layout in which each tile contains a number of nodes equal to N/T rounded to the nearest integer.
 82. The system of claim 81, wherein a second calculated line penalty is associated with a line layout in which a first tile has N/T rounded to the nearest integer minus 4 nodes and a second tile has N/T rounded to the nearest integer plus 4 nodes.
 83. The system of claim 79, wherein the processor is programmed to repeat the programmed steps of claim 79 for every multi-tile line in a paragraph.
 84. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to: receive N nodes to be laid out on multiple tiles on a same line, calculate candidate line penalties for the line, each candidate line penalty being associated with a unique line layout of nodes positioned in the tiles; and define the line as the line layout associated with the lowest candidate line penalty.
 85. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to: begin with a first node in the reading order of a paragraph, calculate an optimal line break scheme for a paragraph layout that ends with the node; and for every subsequent node in the reading order of the paragraph, calculate an optimal line break scheme for a paragraph layout that ends with that subsequent node, wherein each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines, the preceding penalties of all preceding lines being defined by a previously calculated optimal line break scheme, and wherein, if the current line is a multi-tile line, calculating an optimal line break scheme includes calculating line penalties for the current line, each line penalty being associated with a unique line layout of nodes positioned in the tiles.
 86. A system comprising a memory device and a processor coupled to the memory device, the processor programmed to: receive N nodes to be laid out on multiple tiles on a same line, lay out the N nodes in the tiles and calculates a candidate line penalty, reposition some of the N nodes from one of the tiles to another one of the tiles, and calculate additional candidate line penalties, and determine a line penalty of the line as the candidate line penalty having a lowest value.
 87. The system of claim 86, wherein repositioning some of the N nodes comprises repositioning a first number the nodes until doing so does not improve candidate line penalties, and repositioning a second number of the nodes until doing so does not improve candidate line penalties, wherein the first number is larger than the second number. 